Improving the Divide - and - ConquerApproach to Sum - of - PairsMultiple Sequence
نویسنده
چکیده
|We consider the problem of multiple sequence alignment: given k sequences of length at most n and a certain scoring function, nd an alignment that minimizes the corresponding \sum of pairs" distance score. We generalize the divide-and-conquer technique described in 1,2], and present new ideas on how to use eecient search strategies for saving computer memory and accelerating the procedure for three or more sequences. Resulting running times and memory usage are shown for several test cases.
منابع مشابه
Improving the Divide-and-Conquer Approach to Sum-of-Pairs Multiple Sequence Alignment
We consider the problem of multiple sequence alignment: given k sequences of length at most n and a certain scoring function, find an alignment that minimizes the corresponding “sum of pairs” distance score. We generalize the divide-and-conquer technique described in [1,2], and present new ideas on how to use efficient search strategies for saving computer memory and accelerating the procedure ...
متن کاملRepeated Record Ordering for Constrained Size Clustering
One of the main techniques used in data mining is data clustering, which has many applications in computer science, biology, and social sciences. Constrained clustering is a type of clustering in which side information provided by the user is incorporated into current clustering algorithms. One of the well researched constrained clustering algorithms is called microaggregation. In a microaggreg...
متن کاملA comparison of algorithms for minimizing the sum of earliness and tardiness in hybrid flow-shop scheduling problem with unrelated parallel machines and sequence-dependent setup times
In this paper, the flow-shop scheduling problem with unrelated parallel machines at each stage as well as sequence-dependent setup times under minimization of the sum of earliness and tardiness are studied. The processing times, setup times and due-dates are known in advance. To solve the problem, we introduce a hybrid memetic algorithm as well as a particle swarm optimization algorithm combine...
متن کاملImpact of Layout Sequence of the Natural and Synthetic Adsorbents in Double-Layered Composites on Improving the Natural Fiber Acoustic Performance Using the Numerical Finite Element Method
Introduction: The acoustic performance of natural fiber adsorbents has been investigated in numerous studies. A part of these materials show a poor adsorption within the frequency range of less than 1000 Hz. In the present study, attempts were made to investigate the effect of layout sequence of double-layered composites consisting of natural and synthetic fibers on improving the acoustic adsor...
متن کاملPareto-based Multi-criteria Evolutionary Algorithm for Parallel Machines Scheduling Problem with Sequence-dependent Setup Times
This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...
متن کامل